An efficient graph algorithm for dominance constraints
نویسندگان
چکیده
منابع مشابه
An efficient graph algorithm for dominance constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify normal dominance constraints and present an efficient graph algorithm for testing their satisfiablity in deterministic polynomial time. Previously, no polynomial time algorithm was known.
متن کاملAn Efficient MATLAB Algorithm for Graph Partitioning
This report describes a graph partitioning algorithm based on spectral factorization that can be implemented very efficiently with just a hand full of MATLAB commands. The algorithm is closely related to the one proposed by Phillips and Kokotović [3] for state-aggregation in Markov chains. The appendix contains a MATLAB script that implements the algorithm. 1 Graph partitioning Consider an undi...
متن کاملILIGRA: An Efficient Inverse Line Graph Algorithm
This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H , ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H . If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its root graph construction. During the root graph cons...
متن کاملAN EFFICIENT METAHEURISTIC ALGORITHM FOR ENGINEERING OPTIMIZATION: SOPT
Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems so far. In the present study, a simple optimization (SOPT) algorithm with two main steps namely exploration and exploitation, is provided for practical applications. Aside from a reasonable rate of convergence attained, the ease in its implementation and dependen...
متن کاملAn Efficient Algorithm for Mining String Databases Under Constraints
We study the problem of mining substring patterns from string databases. Patterns are selected using a conjunction of monotonic and anti-monotonic predicates. Based on the earlier introduced version space tree data structure, a novel algorithm for discovering substring patterns is introduced. It has the nice property of requiring only one database scan, which makes it highly scalable and applic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2003
ISSN: 0196-6774
DOI: 10.1016/s0196-6774(03)00050-6